java.util.ConcurrentModificationException |
您所在的位置：网站首页 › hashmap concurrentmodification › java.util.ConcurrentModificationException |
java.util.ConcurrentModificationException
Tutorialjava.util.ConcurrentModificationExceptionPublished on August 3, 2022Java Pankaj  While we believe that this content benefits our community, we have not yet thoroughly reviewed it. If you have any suggestions for improvements, please let us know by clicking the “report an issue“ button at the bottom of the tutorial. java.util.ConcurrentModificationException is a very common exception when working with Java collection classes. Java Collection classes are fail-fast, which means if the Collection will be changed while some thread is traversing over it using iterator, the iterator.next() will throw ConcurrentModificationException. Concurrent modification exception can come in the case of multithreaded as well as a single-threaded Java programming environment. java.util.ConcurrentModificationException
Above program will throw java.util.ConcurrentModificationException when executed, as shown in below console logs. List Value:1 List Value:2 List Value:3 Exception in thread "main" java.util.ConcurrentModificationException at java.base/java.util.ArrayList$Itr.checkForComodification(ArrayList.java:937) at java.base/java.util.ArrayList$Itr.next(ArrayList.java:891) at com.journaldev.ConcurrentModificationException.ConcurrentModificationExceptionExample.main(ConcurrentModificationExceptionExample.java:22)From the output stack trace, it’s clear that the concurrent modification exception is thrown when we call iterator next() function. If you are wondering how Iterator checks for the modification, it’s implementation is present in the AbstractList class, where an int variable modCount is defined. The modCount provides the number of times list size has been changed. The modCount value is used in every next() call to check for any modifications in a function checkForComodification(). Now, comment out the list part and run the program again. You will see that there is no ConcurrentModificationException being thrown now. Output: Map Value:3 Map Value:2 Map Value:4Since we are updating the existing key value in the myMap, its size has not been changed and we are not getting ConcurrentModificationException. The output may be different in your system because HashMap keyset is not ordered like a List. If you will uncomment the statement where I am adding a new key-value in the HashMap, it will cause ConcurrentModificationException. To Avoid ConcurrentModificationException in multi-threaded environment You can convert the list to an array and then iterate on the array. This approach works well for small or medium size list but if the list is large then it will affect the performance a lot. You can lock the list while iterating by putting it in a synchronized block. This approach is not recommended because it will cease the benefits of multithreading. If you are using JDK1.5 or higher then you can use ConcurrentHashMap and CopyOnWriteArrayList classes. This is the recommended approach to avoid concurrent modification exception. To Avoid ConcurrentModificationException in single-threaded environmentYou can use the iterator remove() function to remove the object from underlying collection object. But in this case, you can remove the same object and not any other object from the list. Let’s run an example using Concurrent Collection classes. package com.journaldev.ConcurrentModificationException; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.CopyOnWriteArrayList; public class AvoidConcurrentModificationException { public static void main(String[] args) { List myList = new CopyOnWriteArrayList(); myList.add("1"); myList.add("2"); myList.add("3"); myList.add("4"); myList.add("5"); Iterator it = myList.iterator(); while (it.hasNext()) { String value = it.next(); System.out.println("List Value:" + value); if (value.equals("3")) { myList.remove("4"); myList.add("6"); myList.add("7"); } } System.out.println("List Size:" + myList.size()); Map myMap = new ConcurrentHashMap(); myMap.put("1", "1"); myMap.put("2", "2"); myMap.put("3", "3"); Iterator it1 = myMap.keySet().iterator(); while (it1.hasNext()) { String key = it1.next(); System.out.println("Map Value:" + myMap.get(key)); if (key.equals("1")) { myMap.remove("3"); myMap.put("4", "4"); myMap.put("5", "5"); } } System.out.println("Map Size:" + myMap.size()); } }The output of the above program is shown below. You can see that there is no ConcurrentModificationException being thrown by the program. List Value:1 List Value:2 List Value:3 List Value:4 List Value:5 List Size:6 Map Value:1 Map Value:2 Map Value:4 Map Value:5 Map Size:4From the above example it’s clear that: Concurrent Collection classes can be modified safely, they will not throw ConcurrentModificationException. In case of CopyOnWriteArrayList, iterator doesn’t accommodate the changes in the list and works on the original list. In case of ConcurrentHashMap, the behaviour is not always the same.For condition: if(key.equals("1")){ myMap.remove("3");}Output is: Map Value:1 Map Value:null Map Value:4 Map Value:2 Map Size:4It is taking the new object added with key “4” but not the next added object with key “5”. Now if I change the condition to below. if(key.equals("3")){ myMap.remove("2");}Output is: Map Value:1 Map Value:3 Map Value:null Map Size:4In this case, it’s not considering the newly added objects. So if you are using ConcurrentHashMap then avoid adding new objects as it can be processed depending on the keyset. Note that the same program can print different values in your system because HashMap keyset is not ordered. Use for loop to avoid java.util.ConcurrentModificationExceptionIf you are working on single-threaded environment and want your code to take care of the extra added objects in the list then you can do so using for loop rather than an Iterator. for(int i = 0; i |
Let’s see the concurrent modification exception scenario with an example.【本文地址】